Lattice Reduction-Aided Detection for Overloaded MIMO Using Slab Decoding

نویسندگان

  • Ryo Hayakawa
  • Kazunori Hayashi
  • Megumi Kaneko
چکیده

In this paper, we propose an overloaded multiple-input multiple-output (MIMO) signal detection scheme with slab decoding and lattice reduction (LR). The proposed scheme firstly splits the transmitted signal vector into two parts, the post-voting vector composed of the same number of signal elements as that of receive antennas, and the pre-voting vector composed of the remaining elements. Secondly, it reduces the candidates of the pre-voting vector using slab decoding and determines the postvoting vectors for each pre-voting vector candidate by LR-aided minimum mean square error (MMSE)-successive interference cancellation (SIC) detection. From the performance analysis of the proposed scheme, we derive an upper bound of the error probability and show that it can achieve the full diversity order. Simulation results show that the proposed scheme can achieve almost the same performance as the optimal ML detection while reducing the required computational complexity. key words: overloaded MIMO, signal detection, lattice reduction, slab decoding

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice-Based Precoding And Decoding in MIMO Fading Systems

In this thesis, different aspects of lattice-based precoding and decoding for the transmission of digital and analog data over MIMO fading channels are investigated: 1) Lattice-based precoding in MIMO broadcast systems: A new viewpoint for adopting the lattice reduction in communication over MIMO broadcast channels is introduced. Lattice basis reduction helps us to reduce the average transmitte...

متن کامل

Practical HKZ and Minkowski Lattice Reduction Algorithms

Recently, lattice reduction has been widely used for signal detection in multiinput multioutput (MIMO) communications. In this paper, we present three novel lattice reduction algorithms. First, using a unimodular transformation, a significant improvement on an existing Hermite-Korkine-Zolotareff-reduction algorithm is proposed. Then, we present two practical algorithms for constructing Minkowsk...

متن کامل

The Diagonal Reduction Algorithm Using Fast Givens

Recently, a new lattice basis reduction notion, called diagonal reduction, was proposed for lattice-reduction-aided detection (LRAD) of multiinput multioutput (MIMO) systems. In this paper, we improve the efficiency of the diagonal reduction algorithm by employing the fast Givens transformations. The technique of the fast Givens is applicable to a family of LLL-type lattice reduction methods to...

متن کامل

Application of lattice reduction block Korkin-Zolotarev method to MIMO-decoding

This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for different value of the block size and detecting by SIC.

متن کامل

Approximate maximum a posteriori detection for multiple-input-multiple-output systems with bit-level lattice reduction-aided detectors and successive interference cancellation

For iterative detection and decoding (IDD) in multiple-input–multiple-output (MIMO) systems, although the maximum a posteriori (MAP) detector can achieve an optimal performance, because of its prohibitively high computational complexity, various low-complexity approximate MAP detectors are studied. Among the existing MIMO detectors for the non-IDD receivers, lattice reduction (LR)-aided detecto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 99-B  شماره 

صفحات  -

تاریخ انتشار 2016